This is the data repository for manuscript "optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz ε-optimal approach using Lagrangian relaxation".The data repository contains all instances used in our study.The dataset consists in two folders.1) The inputData folder contains all orginal data of numerical instances, 2) The outputData folder contains the solutions of instances. The data are all randomly generated and can be used publicly.</div
International audienceIn this paper, we study a two-stage capacitated facility location problem with...
The capacitated multi-item lot sizing problem consists of finding a production shedule that minimize...
Data for: An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chai...
This is the data repository for manuscript "optimizing a multi-echelon location-inventory problem wi...
International audienceWe consider a multi-echelon joint inventory-location (MJIL) problem that makes...
Facility location problem is one of the strategic logistical drivers within the supply chain which i...
We studied a joint inventory location problem assuming a periodic review for inventory control. A si...
Facility location problems form an important class of integer programming problems, with application...
This paper studies a reliable joint inventory-location problem that optimizes facility locations, cu...
There are often many ways in which a given problem can be relaxed in a Lagrangian fashion. It is not...
The datasets for the papers "Lagrangian heuristics for the capacitated multi-plant lot sizing proble...
textabstractDuring the last two decades, many heuristic procedures for the joint replenishment probl...
National audienceWe consider a two-level lot-sizing problem where the first level consists of N end ...
The capacitated multi-item lot sizing problem consists of finding a production schedule that minimiz...
In this research, we will focus on one variant of the problem: the capacitated facility location pro...
International audienceIn this paper, we study a two-stage capacitated facility location problem with...
The capacitated multi-item lot sizing problem consists of finding a production shedule that minimize...
Data for: An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chai...
This is the data repository for manuscript "optimizing a multi-echelon location-inventory problem wi...
International audienceWe consider a multi-echelon joint inventory-location (MJIL) problem that makes...
Facility location problem is one of the strategic logistical drivers within the supply chain which i...
We studied a joint inventory location problem assuming a periodic review for inventory control. A si...
Facility location problems form an important class of integer programming problems, with application...
This paper studies a reliable joint inventory-location problem that optimizes facility locations, cu...
There are often many ways in which a given problem can be relaxed in a Lagrangian fashion. It is not...
The datasets for the papers "Lagrangian heuristics for the capacitated multi-plant lot sizing proble...
textabstractDuring the last two decades, many heuristic procedures for the joint replenishment probl...
National audienceWe consider a two-level lot-sizing problem where the first level consists of N end ...
The capacitated multi-item lot sizing problem consists of finding a production schedule that minimiz...
In this research, we will focus on one variant of the problem: the capacitated facility location pro...
International audienceIn this paper, we study a two-stage capacitated facility location problem with...
The capacitated multi-item lot sizing problem consists of finding a production shedule that minimize...
Data for: An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chai...